Algebraic Laws for True Concurrency
نویسنده
چکیده
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True Concurrency), APTC (Algebra for Parallelism in True Concurrency), recursion and abstraction. And also, we show the applications and extensions of APTC.
منابع مشابه
An Algebra of Actors Based on True Concurrency
An algebra of actors Aπ fully captures the properties of actors based on asynchronous π-calculus, but, it is based on the interleaving bisimulation semantics. We adjust Aπ to Aπtc to make Aπ having a truly concurrent semantics. We give the syntax and operational semantics of Aπtc, and also the truly concurrent semantics model and algebraic laws of Aπtc.
متن کاملA Calculus for True Concurrency
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...
متن کاملAlgebraic Principles for Rely-Guarantee Style Concurrency Verification Tools
We provide simple equational principles for deriving relyguarantee-style inference rules and refinement laws based on idempotent semirings. We link the algebraic layer with concrete models of programs based on languages and execution traces. We have implemented the approach in Isabelle/HOL as a lightweight concurrency verification tool that supports reasoning about the control and data flow of ...
متن کاملIntroducing concurrency in sequential Java via laws
Nowadays multi-core processors can be found everywhere. It is well-known that one way of improving performance is by parallelization. In this paper we propose a parallelization strategy for Java using algebraic laws. We perform an experiment with two benchmarks and show that our strategy produces a gain similar to a specialized parallel version provided by the Java Grande Benchmark (JGB).
متن کاملLinking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
Complex sfotware systems typically involve features like time, concurrency and probability, and probabilistic computations are playing an increasing role. However it is currently challenging to formalize languages incorporating all those features. Recently the language PTSC has been proposed to integrate probability and time with shared-variable concurrency [56, 59], where the operational seman...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.09035 شماره
صفحات -
تاریخ انتشار 2016